Duality of Transformation Functions in the Interior Point Methods
نویسنده
چکیده
Abstract. In this paper a duality of transformation functions in the interior point method is treated. A dual pair of convex or linear programming problems is considered and the primal problem is transformed by the parametrized transformation function of a more general form than logarithmic is. The construction of the parametrized transformation function for the dual problem is carried out so that both transformation functions were dual. The result obtained explains the unlucid construction of dual transformation functions so far known as a special case of a simple general principle of constructing dual transformation functions.
منابع مشابه
A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization
We present a new full Nesterov and Todd step infeasible interior-point algorithm for semi-definite optimization. The algorithm decreases the duality gap and the feasibility residuals at the same rate. In the algorithm, we construct strictly feasible iterates for a sequence of perturbations of the given problem and its dual problem. Every main iteration of the algorithm consists of a feasibili...
متن کاملAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کاملA full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملLocal Quadratic Convergence of Polynomial-Time Interior-Point Methods for Conic Optimization Problems
In this paper, we establish a local quadratic convergence of polynomial-time interior-point methods for general conic optimization problems. The main structural property used in our analysis is the logarithmic homogeneity of self-concordant barrier functions. We propose new path-following predictor-corrector schemes which work only in the dual space. They are based on an easily computable gradi...
متن کاملVehicle Interior Vibration Simulation-a Tool for Engine Mount Optimization
By new advancements in vehicle manufacturing vehicle quality evaluation and assurance has become a more critical issue. In present work, the vibration transfer path analysis and vibration path ranking of a car interior has been performed. The method is similar to classical multilevel TPA methods but has distinct differences. The method is named VIVS which stands for Vehicle Interior Vibratio...
متن کامل